Weakly-supervised temporal action localization (WTAL) learns to detect and classify action instances with only category labels. Most methods widely adopt the off-the-shelf Classification-Based Pre-training (CBP) to generate video features for action localization. However, the different optimization objectives between classification and localization, make temporally localized results suffer from the serious incomplete issue. To tackle this issue without additional annotations, this paper considers to distill free action knowledge from Vision-Language Pre-training (VLP), since we surprisingly observe that the localization results of vanilla VLP have an over-complete issue, which is just complementary to the CBP results. To fuse such complementarity, we propose a novel distillation-collaboration framework with two branches acting as CBP and VLP respectively. The framework is optimized through a dual-branch alternate training strategy. Specifically, during the B step, we distill the confident background pseudo-labels from the CBP branch; while during the F step, the confident foreground pseudo-labels are distilled from the VLP branch. And as a result, the dual-branch complementarity is effectively fused to promote a strong alliance. Extensive experiments and ablation studies on THUMOS14 and ActivityNet1.2 reveal that our method significantly outperforms state-of-the-art methods.

The statistical heterogeneity of the non-independent and identically distributed (non-IID) data in local clients significantly limits the performance of federated learning. Previous attempts like FedProx, SCAFFOLD, MOON, FedNova and FedDyn resort to an optimization perspective, which requires an auxiliary term or re-weights local updates to calibrate the learning bias or the objective inconsistency. However, in addition to previous explorations for improvement in federated averaging, our analysis shows that another critical bottleneck is the poorer optima of client models in more heterogeneous conditions. We thus introduce a data-driven approach called FedSkip to improve the client optima by periodically skipping federated averaging and scattering local models to the cross devices. We provide theoretical analysis of the possible benefit from FedSkip and conduct extensive experiments on a range of datasets to demonstrate that FedSkip achieves much higher accuracy, better aggregation efficiency and competing communication efficiency. Source code is available at: https://github.com/MediaBrain-SJTU/FedSkip.

在多模式的多代理轨迹预测中，尚未完全解决两个主要挑战：1）如何测量相互作用模块引起的不确定性，从而导致多个试剂的预测轨迹之间引起相关性； 2）如何对多个预测进行排名并选择最佳预测轨迹。为了应对这些挑战，这项工作首先提出了一个新颖的概念，协作不确定性（CU），该概念模拟了互动模块引起的不确定性。然后，我们使用原始置换量等不确定性估计器来构建一般的CU感知回归框架，以完成回归和不确定性估计任务。此外，我们将提出的框架应用于当前的SOTA多代理多模式预测系统作为插件模块，该模块使SOTA系统能够达到1）估计多代理多模式轨迹预测任务的不确定性； 2）对多个预测进行排名，并根据估计的不确定性选择最佳预测。我们对合成数据集和两个公共大规模多代理轨迹预测基准进行了广泛的实验。实验表明：1）在合成数据集上，Cu-Aware回归框架允许模型适当地近似地面真相拉普拉斯分布； 2）在多代理轨迹预测基准上，Cu-Aware回归框架稳步帮助SOTA系统改善了其性能。特别是，提出的框架帮助Vectornet在Nuscenes数据集中所选最佳预测的最终位移误差方面提高了262 cm； 3）对于多机构多模式轨迹预测系统，预测不确定性与未来随机性呈正相关； 4）估计的CU值与代理之间的交互式信息高度相关。

本文考虑了快速MRI重建的问题。我们提出了一个基于变压器的新型框架，用于直接处理K空间中稀疏采样的信号，超出了像Convnets一样的常规网格的限制。我们采用频谱图的隐式表示，将空间坐标视为输入，并动态查询部分观察到的测量值以完成频谱图，即学习K空间中的电感偏置。为了在计算成本和重建质量之间保持平衡，我们分别建立了一个具有低分辨率和高分辨率解码器的层次结构。为了验证我们提出的模块的必要性，我们在两个公共数据集上进行了广泛的实验，并表现出优于最先进方法的卓越或可比性。

自我监督的学习在表示视觉和文本数据的表示方面取得了巨大的成功。但是，当前的方法主要在经过良好策划的数据集中验证，这些数据集未显示现实世界的长尾分布。在损失的角度或模型观点中，重新平衡的重新平衡是为了考虑自我监督的长尾学习的最新尝试，类似于被监督的长尾学习中的范式。然而，没有标签的帮助，由于尾巴样品发现或启发式结构设计的限制，这些探索并未显示出预期的明显希望。与以前的作品不同，我们从替代角度（即数据角度）探索了这个方向，并提出了一种新颖的增强对比度学习（BCL）方法。具体而言，BCL利用深神经网络的记忆效果自动推动对比度学习中样本视图的信息差异，这更有效地增强了标签 - unaware环境中的长尾学习。对一系列基准数据集进行的广泛实验证明了BCL对几种最新方法的有效性。我们的代码可在https://github.com/mediabrain-sjtu/bcl上找到。

我们展示了MVLayoutNet，是来自多视图全景的整体三维重建端到端网络。我们的核心贡献是无缝地将学习的单目布局估计和多视图立体声（MV）结合起来，以便在3D和图像空间中准确地重建。我们共同列出布局模块以产生初始布局和新型MVS模块，以获得精确的布局几何形状。与标准MVSNET [33]不同，我们的MVS模块采用新建的布局成本卷，其在相同的深度层中聚合到相应的布局元件中的多视图成本。我们还提供了一种基于注意的方案，指导MVS模块专注于结构区域。这种设计考虑了本地像素级成本和全球整体信息，以便更好地重建。实验表明，我们的方法在2D-3D-S [1]和Zind [5]数据集中，在深度RMSE方面以21.7％和20.6％表示最先进的。最后，我们的方法导致连贯的布局几何，使整个场景的重建能够。

在本文中，我们针对零射肿瘤分割的自我监督代表学习。我们提出以下贡献：首先，我们主张零拍摄设置，其中预培训的模型应该直接适用于下游任务，而无需使用任何手动注释。其次，我们从“层分解”中获取灵感，并创新了模拟肿瘤数据的培训制度。第三，我们进行广泛的消融研究，以分析数据模拟中的关键组成部分，并验证不同代理任务的必要性。我们证明，在模拟中具有足够的质地随机化，培训的模型可以毫不费力地推广到分段实际肿瘤数据。第四，我们的方法在不同下游数据集上实现了零射肿瘤分割的优异成果，对于脑肿瘤细分和LITS2017进行肝脏肿瘤分割。在评估低注释制度下评估肿瘤细分的模型可转移性，拟议方法也优于所有现有的自我监督方法，在实际情况下开辟了自我监督学习的使用。

以前的研究，将一般神经计算机翻译（NMT）模型调整为特定域通常忽略同一域内的翻译中的分集，这是真实情景中域适应的核心问题。这种具有挑战性的情景的一个代表是部署与特定主题的会议的翻译系统，例如全球变暖或冠状病毒，因为时间表通常存在极低的资源。为了激励在这种情况下更广泛的调查，我们在机器翻译（Flgada）中展示了一个真实的细粒度域适应任务。 Flgada DataSet由汉英翻译任务组成，用于信息技术的四个子域：自治车辆，AI教育，实时网络和智能手机。每个子域都配备有开发集和测试集以进行评估目的。为了更接近现实，Flgada不采用任何域名双语培训数据，但提供双语词典和Wiki知识库，这可以在短时间内更容易获得。我们基准于细粒度的域适应任务，并显示深入的分析，表明存在仍然有挑战性的问题，以进一步提高异构资源的性能。

Action recognition with skeleton data has recently attracted much attention in computer vision. Previous studies are mostly based on fixed skeleton graphs, only capturing local physical dependencies among joints, which may miss implicit joint correlations. To capture richer dependencies, we introduce an encoder-decoder structure, called A-link inference module, to capture action-specific latent dependencies, i.e. actional links, directly from actions. We also extend the existing skeleton graphs to represent higherorder dependencies, i.e. structural links. Combing the two types of links into a generalized skeleton graph, we further propose the actional-structural graph convolution network (AS-GCN), which stacks actional-structural graph convolution and temporal convolution as a basic building block, to learn both spatial and temporal features for action recognition. A future pose prediction head is added in parallel to the recognition head to help capture more detailed action patterns through self-supervision. We validate AS-GCN in action recognition using two skeleton data sets, NTU-RGB+D and Kinetics. The proposed AS-GCN achieves consistently large improvement compared to the state-of-the-art methods. As a side product, AS-GCN also shows promising results for future pose prediction. Our code is available at https://github.com/limaosen0/AS-GCN . 1

This study provides a new understanding of the adversarial attack problem by examining the correlation between adversarial attack and visual attention change. In particular, we observed that: (1) images with incomplete attention regions are more vulnerable to adversarial attacks; and (2) successful adversarial attacks lead to deviated and scattered attention map. Accordingly, an attention-based adversarial defense framework is designed to simultaneously rectify the attention map for prediction and preserve the attention area between adversarial and original images. The problem of adding iteratively attacked samples is also discussed in the context of visual attention change. We hope the attention-related data analysis and defense solution in this study will shed some light on the mechanism behind the adversarial attack and also facilitate future adversarial defense/attack model design.